課程影片與練習
課程簡介
第1週：網路架構與七層參考模式簡介
第2週：IEEE 802.3 乙太網路 (Ethernet)
第3週：IEEE 802.11 無線區域網路 (Wireless LAN)
第4週：IEEE 802.1D 交換機的擴張樹演算法 (Spanning Tree Algorithm)
第5週：IEEE 802.1Q 虛擬區域網路 (Virtual LAN)
第6週：區域網路可靠傳輸技術 －－ 滑動視窗技術
第7週：路由器運作原理以及網路互連技術
※觀看影片請點擊影片名稱後方的"YOUTUBE"或"YOUKU"，
觀看YOUKU影片，請輸入密碼：mooc01004
第8週：TCP 與網路阻塞偵測與控制技術
 |
7.24 Which of the following statements are correct for “Link State” routing protocol ? Assume that each node knows the cost of the link to each of its directly connected neighbors.
下列哪些對於 ”鏈結狀態(Link State)”路由協議的敘述是正確的 ? 假設每個節點都知道與它直接相連的鄰居之間的鏈結成本
|
| (a)Each node constructs a one dimensional array (a vector) containing the “distances” (costs) to all other nodes and distributes that vector to its immediate neighbors. 每個節點建立一個一維陣列(向量)，其包含 ”距離”(成本)到所有其他節點，並散布給緊鄰的鄰居 | |
| (b)Each node constructs a one dimensional array (a vector) containing the “distances” (costs) to all other nodes and distributes that vector to all other nodes. 每個節點建立一個一維陣列(向量)，其包含 “距離”(成本)到所有其他節點，並散布給所有其他節點 | |
| (c)Each node constructs a one dimensional array (a vector) containing the “distances” (costs) to its immediate neighbors and distributes that vector to all other nodes. 每個節點建立一個一維陣列(向量)，其包含 ”距離”(成本)到緊鄰的的鄰居，並散布給所有其他節點 | |
| (d)Each node constructs a one dimensional array (a vector) containing the “distances” (costs) to its immediate neighbors and distributes that vector to its immediate neighbors. 每個節點建立一個一維陣列(向量)，其包含 “距離”(成本)到緊鄰的鄰居，並散布給緊鄰的鄰居 | |
| (e)The link state packets (LSP) are sent to all other nodes by using reliable flooding algorithm. 鏈結狀態封包(LSP) 是藉由可靠洪水廣播演算法送給其他所有節點 |
|
7.25 Which of the following statements are correct for “Open Shortest Path First (OSPF)” routing protocol ?
下列哪些對於“開放式最短路徑優先 (OSPF)”路由協議的敘述是正確的 ?
|
| (a)It’s a Distance Vector based routing protocol 它是基於距離向量的路由協議 | |
| (b)It’s a Link State based routing protocol 它是基於鏈結狀態的路由協議 | |
| (c)Each router computes its routing table directly from the LSP’s it has collected using the Dijkstra’s algorithm 每個路由器藉由 Dijkstra 演算法，根據目前為止收到的 LSP 封包內容去計算它的路由表 | |
| (d)It finds the shortest path from the router to each other node 每一個路由器會找出該路由器到所有節點的最短路徑 | |
| (e)It finds the shortest path from the each other node to the router. 每一個路由器會找出所有節點到該路由器的最短路徑 |
檔案上傳中...